A Fast Stereo Matching Method
نویسنده
چکیده
Stereo matching is important in the area of computer vision and photogrammetry. This paper presents a fast stereo matching algorithm which produces a dense disparity map by using a pyramid structure, fast correlation and dynamic programming techniques. Fast correlation is achieved by using the box filtering technique which is invariant to the size of the correlation window. The disparity for each scan line is found in the correlation matrix by finding the best path using dynamic programming rather than simply choosing the position that gives the maximum correlation coefficient. Both synthetic and real image tests have been performed, and good results have been obtained.
منابع مشابه
Effective Parameters in Search Space Reduction Used in a Fast Edge-based Stereo Matching
Reduction of search region in stereo correspondence can increase performances of the matching process, in the context of execution time and accuracy. For an edge-based stereo matching, we establish relationships between the search space and the parameters like relative displacement of edges, disparity under consideration, image resolution, CCD (Charge-Coupled Device) dimension and focal length ...
متن کاملFast Edge - Based Stereo Matching and Geometric Parameters 1
The reduction of the search region in stereo correspondence can improve the performance of the matching process in terms of execution time and accuracy. For the edge-based stereo matching, we establish the relationship between a search space and parameters such as relative displacement of the edges, the disparity under consideration, the image resolution, the CCD dimension, and the focal length...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملFast Stereo Matching Using Rectification and Correlation Techniques
F This paper presents a new method for matching points of interest in stereoscopic. A self-calibration is realized by using points of interest on both images in order to estimate the fundamental matrix from which we can compute both projected matrices related to each camera. We propose a robust and fast rectification technique for matching points of interest in order to simplify the research on...
متن کاملFast Cost Computation Using Binary Information for Illumination Invariant Stereo Matching
Stereo matching methods are used to estimate disparity values from captured stereo images. They exploit characteristics of binocular disparity for disparity estimation. Stereo images captured under practical conditions have different illumination status, which causes disparity errors in the matching operation. To solve this problem, we can use the adaptive normalized cross correlation (ANCC) as...
متن کامل